Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction
نویسندگان
چکیده
This paper explains the principles of dependency analysis by reduction and its correspondence to the notions of dependency and dependency tree. The explanation is illustrated by examples from Czech, a language with a relatively high degree of word-order freedom. The paper sums up the basic features of methods of dependency syntax. The method serves as a basis for the verification (and explanation) of the adequacy of formal and computational models of those methods.
منابع مشابه
تأثیر ساختواژهها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملToward A Parsing Method For Free Word Order Languages
,,Free word order" is a traditional term that should not be taken literally. However, we shall retain the term for its conciseness. Formal descriptions of =yntax have been usually based either on the immediate constituents or on the dependency p~ilosophy. Neither of them seems directly applicable to free word order languages. The intertwining phrases cannot be described naturally by IC rules. S...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملA Right-to-Left Chart Parsing for Dependency Grammar using Headable Paths
In this paper, we propose a right-to-left dependency grammar parsing method for languages in which a governor appears after its modiier like Korean and Japanese. Unlike conventional left-to-right parsers, this parsing method can take advantage of the governor post-positioning property of such languages to reduce the size of search space by using the idea of a head-able path. A headable path is ...
متن کاملA Grammar Based Approach To A Grammar Checking Of Free Word Order Languages
This paper shows one of the methods used for grammar checking, as it is being developed in the frame of the EC funded project LATESLAV -Language Technology li)r Slavic Languages (PECO 2824). The languages under consideration in the project Czech and Bulgarian are both free word order languages, therefore it is not sufficient to use only simple pattern based methods for error checking. The empha...
متن کامل